منابع مشابه
Randomness and Universal Machines
The present work investigates several questions from a recent survey of Miller and Nies related to Chaitin’s Ω numbers and their dependence on the underlying universal machine. It is shown that there are universal machines for which ΩU is just ∑ x 2 1−H(x). For such a universal machine there exists a co-r.e. set X such that ΩU [X] = ∑ p:U(p)↓∈X 2 −|p| is neither left-r.e. nor Martin-Löf random....
متن کاملUniversal security for randomness expansion
We show that any spatially separated multi-part quantum device demonstrating nonlocality can be used in an untrusted-device protocol for randomness expansion with unconditional quantum security. A consequence is that the noise tolerance for secure randomness expansion only needs to be small enough that it rules out deterministic behavior of the device. This greatly reduces the requirement on im...
متن کاملUniversal test for Hippocratic randomness
Hippocratic randomness is defined in a similar way to Martin-Löf randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of probability and show the existence of the universal test (Levin-Schnorr theorem) for Hippocratic randomness when the logarithm of the probability is approximated wi...
متن کاملUniversal scaling in mixing correlated growth with randomness.
We study two-component growth that mixes random deposition (RD) with a correlated growth process that occurs with probability p. We find that these composite systems are in the universality class of the correlated growth process. For RD blends with either Edwards-Wilkinson or Kardar-Parisi-Zhang processes, we identify a nonuniversal exponent in the universal scaling in p.
متن کاملHardness as randomness: a survey of universal derandomization
We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that P = BPP , it also indicates that this may be a difficult question to resolve. In fact, proving that probalistic algorithms have non-trivial deterministic simulations is basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics-Uspekhi
سال: 2011
ISSN: 1063-7869,1468-4780
DOI: 10.3367/ufne.0181.201103b.0269